/*Emamul Islam Emon.      Id No: 093-15-844

 10)Example of Insertion Sort.  */



#include<stdio.h>
#include<conio.h>
int main()
{
int i, j, k,ptr,temp,n, a[100];
clrscr();
a[0] = -1;
printf("Enter the number of element:");
scanf("%d", &n);
for (i = 1;i <= n;i++)
scanf("%d", &a[i]);
for (k = 2;k <= n;k++)
{
temp = a[k];
ptr = k - 1;
while (ptr>0 && temp < a[ptr])
{
a[ptr+1]=a[ptr];
ptr=ptr-1;
}
a[ptr+1]=temp;
}
printf("The sorted element is:\n");
for(i=1;i<=n;i++)
printf("%d\t",a[i]);
getch();
return 0;
}



















































		 

